A formal framework for quantifying voter-controlled privacy

نویسندگان

  • Hugo L. Jonker
  • Sjouke Mauw
  • Jun Pang
چکیده

Privacy is a necessary requirement for voting. Without privacy, voters can be forced to vote in specific ways, and the forcing party can check their compliance. But offering privacy does not suffice: if a voter can reduce her privacy, an attacker can force her to do so. In this paper, we distinguish various ways that a voter can communicate with the intruder to reduce her privacy and classify them according to their ability to reduce the privacy of a voter. We develop a framework combining knowledge reasoning and trace equivalences to formally model voting protocols and define voter-controlled privacy. Our framework is quantitative, in the sense that it defines a measure for the privacy of a voter. Therefore, the framework can precisely measure the level of privacy for a voter for each of the identified privacy-reduction classes. The quantification allows our framework to capture receipts that reduce, but not nullify, the privacy of the voter.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Practical Privacy Preserving E-Voting Protocol Using Dynamic Ballots

We describe a practical e-voting protocol which guarantees e-voting protocol requirements: eligibility, privacy, accuracy, fairness, receipt-freeness, uncoercibility, robustness and verifiability. Unlike existing blind signature based protocols, in which the authority blindly signs ballot or part of ballot, the authority in our protocol blindly signs voter’s pseudo identity. Hereafter, voter be...

متن کامل

Towards Verifying Voter Privacy through Unlinkability

The increasing official use of security protocols for electronic voting deepens the need for their trustworthiness, hence for their formal verification. The impossibility of linking a voter to her vote, often called voter privacy or ballot secrecy, is the core property of many such protocols. Most existing work relies on equivalence statements in cryptographic extensions of process calculi. Thi...

متن کامل

Approximate Measurement of Voter Privacy Loss in an Election with Precinct Reports

The California election process publishes tallies for each precinct as part of each county’s Statement of Vote. We take a data set from two California counties in the November 2004 election and use it to measure an approximate voter privacy loss : how much information is leaked about a voter’s vote by publishing precinct tallies. Our starting point is the privacy measurement framework of Coney ...

متن کامل

A Formal Logic Framework for Receipt-freeness in Internet Voting Protocol

The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, coercion-resistant. Receiptfreeness is a key property. Receipt-freeness means that the voter can't produce a receipt to prove that he votes a special ballot. Its purpose is to protect against vote buying. Form...

متن کامل

Accessible Voter-Verifiability

All voter-verifiable voting schemes in the literature require that the voter be able to see and to mark. This paper describes modifications to the Prêt à Voter and PunchScan schemes so that a voter who can either see or hear, or both, independent of marking ability, may avail of voter-verifiability without revealing her vote. The modified systems would provide privacy and integrity guarantees t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Algorithms

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2009